Linear programming with variable matrix entries
نویسندگان
چکیده
منابع مشابه
Linear programming with variable matrix entries
We consider linear programming (continuous or integer) where some matrix entries are decision parameters. If the variables are nonnegative the problem can be easily solved in two phases. It is shown that direct costs on the matrix entries make the problem NP-hard. Finally a strong duality result is provided.
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولMatrix Games, Linear Programming, and Linear Approximation
qi = 1, pA ≥ v ≥ Aq. The number v is known as the value of game. The pair (p, q) is known as an equilibrium for the matrix game. As usual, x ≥ 0 means that every entry of the vector x is ≥ 0. We write y ≤ t for a vector y and a number t if every entry of y is ≤ t. We go even further in abusing notation, denoting by y− t the vector obtaining from y by subtracting t from every entry. Similarly we...
متن کاملMatrix Completion with Noisy Entries and Outliers
This paper considers the problem of matrix completion when the observed entries are noisy and contain outliers. It begins with introducing a new optimization criterion for which the recovered matrix is defined as its solution. This criterion uses the celebrated Huber function from the robust statistics literature to downweigh the effects of outliers. A practical algorithm is developed to solve ...
متن کاملLinear Programming in Matrix Form
We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm, which has become the basis of all commercial computer codes for linear programming, simply recognizes that much of the information calculated by the simplex method at each iteration, as described in Chapter 2, is not needed. Thus, efficienci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2005
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.04.011